Deadlock-Free Routing In Irregular Networks Using Prefix Routing

In this paper, we propose a deadlock-free routing in irregular networks using pre x routing. Pre x routing is a special type of routing with a compact routing table associated with each node (processor). Basically, each outgoing channel of a node is assigned a special label and an outgoing channel is selected if its label is a pre x of the label of the destination node. Node and channel labeling in an irregular network is done through constructing a spanning tree. The routing process follows a two-phase process of going up and then down along the spanning tree, with a possible cross channel (shortcut) between two branches of the tree between two phases. We show that the proposed routing scheme is deadlockand livelockfree. Possible extensions are also discussed.